منابع مشابه
Nonlinear Filtering with Optimal MTLL
We consider the problem of nonlinear filtering of one-dimensional diffusions from noisy measurements. The filter is said to lose lock if the estimation error exits a prescribed region. In the case of phase estimation this region is one period of the phase measurement function, e.g., [−π, π]. We show that in the limit of small noise the causal filter that maximizes the mean time to loose lock is...
متن کاملAsymptotically optimal filtering in linear systems with fractional Brownian noises
In this paper, the filtering problem is revisited in the basic Gaussian homogeneous linear system driven by fractional Brownian motions. We exhibit a simple approximate filter which is asymptotically optimal in the sense that, when the observation time tends to infinity, the variance of the corresponding filtering error converges to the same limit as for the exact optimal filter.
متن کاملA new approach to optimal nonlinear filtering
The classical approach to designing lters for systems where system equations are linear and measurement equations are nonlinear is to linearise measurement equations, and apply an Extended Kalman Filter (EKF). This results in suboptimal, biased, and often divergent lters. Many schemes proposed to improve the performance of the EKF concentrated on better linearisation techniques, iterative techn...
متن کاملLocally asymptotically optimal tests for nonlinear time-series models
Based on the local asymptotic normality (LAN) of the log-likelihood ratio statistic, we proposed some distribution-free tests for examining simultaneously hypotheses about the conditional mean and the conditional variance functions in time series models. Our results are established under stationarity and ergodicity conditions with unspecified "innovation" densities under the null hypothesis as ...
متن کاملAsymptotically Optimal Deterministic Rendezvous
In this paper, we address the deterministic rendezvous in graphs where k mobile agents, disseminated at different times and different nodes, have to meet in finite time at the same node. The mobile agents are autonomous, oblivious, labeled, and move asynchronously. Moreover, we consider an undirected anonymous connected graph. For this problem, we exhibit some asymptotical time and space lower ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2007
ISSN: 1474-6670
DOI: 10.3182/20070625-5-fr-2916.00129